Distributed Storage Systems based on Equidistant Subspace Codes
نویسندگان
چکیده
Distributed storage systems based on equidistant constant dimension codes are presented. These equidistant codes are based on the Plücker embedding, which is essential in the repair and the reconstruction algorithms. These systems posses several useful properties such as high failure resilience, minimum bandwidth, low storage, simple algebraic repair and reconstruction algorithms, good locality, and compatibility with small fields.
منابع مشابه
Equidistant subspace codes
In this paper we study equidistant subspace codes, i.e. subspace codes with the property that each two distinct codewords have the same distance. We provide an almost complete classification of such codes under the assumption that the cardinality of the ground field is large enough. More precisely, we prove that for most values of the parameters, an equidistant code of maximum cardinality is ei...
متن کاملHybrid Regenerating Codes for Distributed Storage Systems
Distributed storage systems are mainly justified due to their ability to store data reliably over some unreliable nodes such that the system can have long term durability. Recently, regenerating codes are proposed to make a balance between the repair bandwidth and the storage capacity per node. This is achieved through using the notion of network coding approach. In this paper, a new variation ...
متن کاملExact Regenerating Codes for Distributed Storage
Erasure coding techniques are used to increase the reliability of distributed storage systems while minimizing storage overhead. The bandwidth required to repair the system after a node failure also plays a crucial role in the system performance. In [1] authors have shown that a tradeoff exists between storage and repair bandwidth. They also have introduced the scheme of regenerating codes whic...
متن کاملE-msr Codes Based Distributed Storage Systems with Fixed Number of Redundancy Nodes
Distributed storage systems are becoming more and more popular with the rapidly increasing demand for large-scale data storage. To increase the capacity and I/O performance of a distributed storage system, scaling it up is a common method. Regenerating Codes are a class of distributed storage codes that offer good reliability through encoding and provide good bandwidth cost on failed nodes repa...
متن کاملA Non-MDS Erasure Code Scheme for Storage Applications
This paper investigates the use of redundancy and self repairing against node failures indistributed storage systems using a novel non-MDS erasure code. In replication method, accessto one replication node is adequate to reconstruct a lost node, while in MDS erasure codedsystems which are optimal in terms of redundancy-reliability tradeoff, a single node failure isrepaired after recovering the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1406.6170 شماره
صفحات -
تاریخ انتشار 2014